Optimal Assignment Plan in Sliced Backhaul Networks

Optimal capacity assignment in general queueing networks

We consider the problem of how best to assign the service capacity in a queueing network in order to minimise the expected delay under a cost constraint. We study systems with several types of customers, general service time distributions, stochastic or deterministic routing, and a variety of service regimes. For such networks there are typically no analytical formulae for the waiting time dist...

Routing and Spectrum Assignment for Constant Bit Rate Connections in Spectrum Sliced Elastic Optical Path Networks

In this paper a heuristic algorithm for finding an optical path in elastic optical path networks is proposed. The proposed algorithm for connection requests finds a spectrum required from an aggregated spectrum of the path belonging to a set of shortest paths measured by the number of links. It has been shown that the proposed algorithm rejects definitely fewer connection requests than the well...

A Base Station Assignment Strategy for Radio Access Networks with Backhaul Constraints

Existing base station (BS) assignment methods in mobile networks are mainly driven by radio conditions. This is because it is assumed that the limiting factor in the access network is basically on the air interface. However, a growing concern is that the transport part of the mobile network can also represent a bottleneck. Thus, mechanisms only based on radio conditions may assign a user to a B...

Fair inter-TAP routing and backhaul assignment for wireless mesh networks

Although limiting the number of backhauls, specifically chosen transit access points (TAPs) that forward traffic from other TAPs, reduces the overall costs of a wireless mesh network (WMN), an egress bottleneck is induced, which aggregates traffic and limits the bandwidth. To avoid such problems while working to minimize budgetary expenses, we balanced traffic flow on ‘to-be-determined’ backhau...

Wireless backhaul in future heterogeneous networks